Look and Say Fibonacci
نویسنده
چکیده
The LS (Look and Say) derivative of a word is obtained by writing the number of consecutive equal letters when the word is spelled from left to right. For example, LS(1 1 2 3 3) = 2 1 1 2 2 3 (two 1, one 2, two 3). We start the study of the behaviour of binary words generated by morphisms under the LS operator, focusing in particular on the Fibonacci word. Résumé. La dérivée LS d’un mot est obtenue en décrivant les blocs de lettres qui apparaissent quand on épelle le mot. Par exemple, LS(1 1 2 3 3) = 2 1 1 2 2 3 (deux 1, un 2, deux 3). Nous commençons l’étude de la transformation, par l’opération LS, des mots binaires engendrés par morphismes. Notre attention se porte ici en particulier sur le mot de Fibonacci. 1991 Mathematics Subject Classification. 68R15.
منابع مشابه
The Euclidean Algorithm and a Generalization of the Fibonacci Sequence
This paper will explore the relationship between the Fibonacci numbers and the Euclidean Algorithm in addition to generating a generalization of the Fibonacci Numbers. It will also look at the ratio of adjacent Fibonacci numbers and adjacent generalized Fibonacci numbers. Finally it will explore some fun applications and properties of the Fibonacci numbers.
متن کاملOn the Fibonacci Numbers
The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties which are worth attention. In this set of notes, we will look at some of the important features of these numbers. In the first half of the notes, our attention shall be paid to the relationship of the Fibonacci numbers and the Euclidean ...
متن کاملSome Properties of Fibonacci Numbers
We formalized some basic properties of the Fibonacci numbers using definitions and lemmas from [7] and [23], e.g. Cassini’s and Catalan’s identities. We also showed the connections between Fibonacci numbers and Pythagorean triples as defined in [31]. The main result of this article is a proof of Carmichael’s Theorem on prime divisors of prime-generated Fibonacci numbers. According to it, if we ...
متن کاملOn k-Fibonacci numbers of arithmetic indexes
In this paper, we study the sums of k-Fibonacci numbers with indexes in an arithmetic sequence, say anþ r for fixed integers a and r. This enables us to give in a straightforward way several formulas for the sums of such numbers. 2008 Elsevier Inc. All rights reserved.
متن کاملOn the First Digits of the Fibonacci Numbers and Their Euler Function
Here, we show that given any two finite strings of base b digits, say s1 and s2, there are infinitely many Fibonacci numbers Fn such that the base b representation of Fn starts with s1 and the base b representation of φ(Fn) starts with s2. Communicated by Oto Strauch
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 42 شماره
صفحات -
تاریخ انتشار 2008